Direction Matters: On Influence-Preserving Graph Summarization and Max-Cut Principle for Directed Graphs
نویسندگان
چکیده
منابع مشابه
On max cut in cubic graphs
This paper is concerned with the maximum cut problem in parallel on cubic graphs. New theoretical results characterizing the cardinality of the cut are presented. These results make it possible to design a simple combinatorial O(log n) time parallel algorithm , running on a CRCW PRAM with O(n) processors. The approximation ratio achieved by the algorithm is 1: 3 and improves the best known para...
متن کاملMax-Cut Under Graph Constraints
An instance of the graph-constrained max-cut (GCMC) problem consists of (i) an undirected graph G = (V,E) and (ii) edge-weights c : ( V 2 ) → R+ on a complete undirected graph. The objective is to find a subset S ⊆ V of vertices satisfying some graph-based constraint in G that maximizes the weight ∑ u∈S,v 6∈S cuv of edges in the cut (S, V \ S). The types of graph constraints we can handle inclu...
متن کاملMax-cut in circulant graphs
Poljak, S. and D. Turzik, Max-cut in circulant graphs, Discrete Mathematics 108 (1992) 379-392. We study the max-cut problem in circulant graphs C,,,, where C,,, is a graph whose edge set consists of a cycle of length n and all the vertex pairs of distance r on the cycle. An efficient solution of the problem is obtained so that we show that there is always a maximum cut of a particular shape, c...
متن کاملA Simple Topology Preserving Max-Flow Algorithm for Graph Cut Based Image Segmentation
In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm [2] in order to make the algorithm preserve the topology of an initial interface. This algorithm is being widely used in computer vision and image processing fields for its efficiency and speed when dealing with problems such as graph cut based image segmentation. Using our modification we are able to incor...
متن کاملCut-Matching Games on Directed Graphs
We give O(log n)-approximation algorithm based on the cut-matching framework of [10, 13, 14] for the computing the sparsest cut on directed graphs. Our algorithm uses only O(log n) single commodity max-flow computations and thus breaks the multicommodity-flow barrier for computing the sparsest cut on directed graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neural Computation
سال: 2021
ISSN: 0899-7667,1530-888X
DOI: 10.1162/neco_a_01402